Avoidable structures, II: finite distributive lattices and nicely-structured ordered sets
نویسندگان
چکیده
Let 〈D,≤〉 be the ordered set of isomorphism types of finite distributive lattices, where the ordering is by embeddability. We characterize the order ideals in 〈D,≤〉 that are well-quasi-ordered by embeddability, and thus characterize the members of D that belong to at least one infinite anti-chain in D.
منابع مشابه
FUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملAvoidable structures, I: Finite ordered sets, semilattices and lattices
We find all finite unavoidable ordered sets, finite unavoidable semilattices and finite unavoidable lattices.
متن کاملA duality between fuzzy domains and strongly completely distributive $L$-ordered sets
The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...
متن کاملDistributive Ordered Sets and Relative Pseudocomplements
Brouwerian ordered sets generalize Brouwerian lattices. The aim of this paper is to characterize α-complete Brouwerian ordered sets in a manner similar to that used previously for pseudocomplemented, Stone, Boolean and distributive ordered sets. The sublattice G(P ) in the Dedekind-Mac Neille completion DM(P ) of an ordered set P generated by P is said to be the characteristic lattice of P . We...
متن کاملCoproducts of bounded distributive lattices: cancellation
Let L ∗ M denote the coproduct of the bounded distributive lattices L and M . At the 1981 Banff Conference on Ordered Sets, the following question was posed: What is the largest class L of finite distributive lattices such that, for every non-trivial Boolean lattice B and every L ∈ L, B ∗ L = B ∗ L′ implies L = L′? In this note, the problem is solved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011